Embedding Rectangular Grids into Square Grids with Dilation Two
نویسندگان
چکیده
Absfrucl-In this paper, a new technique, the multiple ripple propagation technique, is presented for mapping an h x w grid into a w x h grid such that the dilation cost is 2, i.e., such that any two neighboring nodes in the first grid are mapped onto two nodes in the second grid that are separated by a distance of at most 2. This technique is then used as a basic tool for mapping any rectangular source grid into a square target grid with the dilation two property preserved. The ratio of the number of nodes in the source grid to the number of nodes in the target grid, called the expansion cost, is shown to be always less than 1.2. This is a significant improvement over the previously suggested techniques, where the expansion cost could be bounded by 1.2 only if the dilation cost was allowed to be as high as 18.
منابع مشابه
Combination of Adaptive-Grid Embedding and Redistribution Methods on Semi Structured Grids for two-dimensional invisid flows
Among the adaptive-grid methods, redistribution and embedding techniques have been the focus of more attention by researchers. Simultaneous or combined adaptive techniques have also been used. This paper describes a combination of adaptive-grid embedding and redistribution methods on semi-structured grids for two-dimensional invisid flows. Since the grid is semi-structured, it is possible to us...
متن کاملCombination of Adaptive-Grid Embedding and Redistribution Methods on Semi Structured Grids for two-dimensional invisid flows
Among the adaptive-grid methods, redistribution and embedding techniques have been the focus of more attention by researchers. Simultaneous or combined adaptive techniques have also been used. This paper describes a combination of adaptive-grid embedding and redistribution methods on semi-structured grids for two-dimensional invisid flows. Since the grid is semi-structured, it is possible to us...
متن کاملOptimal Embedding of Complete Binary Trees into Lines and Grids
We consider several graph embedding problems which have a lot of important applications in parallel and distributed computing and which have been unsolved so far. Our major result is that the complete binary tree can be embedded into the square grid of the same size with almost optimal dilation (up to a very small factor). To achieve this, we rst state an embedding of the complete binary tree i...
متن کاملOn Re nement of 2-Dimensional Grids
The subject of this paper are grid reenements arising in nite element methods and their embedding into grids. We concentrate on embeddings with dilation 1 and construct for a class of grid reenements their embeddings with optimal load. For general cases we show that the problem to determine the minimal load is NP-complete.
متن کاملOn Refinement of 2-Dimensional Grids
The subject of this paper are grid refinements arising in finite element methods and their embedding into grids. We concentrate on embeddings with dilation 1 and construct for a class of grid refinements their embeddings with optimal load. For general cases we show that the problem to determine the minimal load is NP-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 39 شماره
صفحات -
تاریخ انتشار 1990